Transcendental Arguments, Conceivability, and Global Vs. Local Skepticism

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two Conceivability Arguments Compared

The conclusion of this argument (hereafter ZA) entails the falsity of physicalism because, technical details aside, physicalism is or entails the thesis that every psychological truth is entailed by some physical truth. If it is possible that I have a zombie duplicate however, then it is possible that the physical truths are as they are and some psychological truth is different. Hence 3 entails...

متن کامل

Structural Realism and Abductive-Transcendental Arguments

The paper deals with an attempt to present an “abductive-transcendental” argument in favour of a particular version of structural realism (SR), dubbed Intermediate SR. In the first part of the paper the general structure of transcendental arguments is scrutinized with a close view on Kant’s original version and the prospect of their abductive variation. Then the role of symmetries in modern phy...

متن کامل

Local vs . Global : Intelligent Local Face Recognition

Face recognition in real world applications is a very difficult task because of image misalignments, pose and illumination variations, or occlusions. Many researchers in this field have investigated both face representation and classification techniques able to deal with these drawbacks. However, none of them is free from limitations. Early proposed algorithms were generally holistic, in the se...

متن کامل

Cassam on the Possibility of Knowledge and Transcendental Arguments

a SPECIAL ISSUE IV, pp. 45 – 57, 2009 CASSAM ON THE POSSIBILITY OF KNOWLEDGE AND TRANSCENDENTAL ARGUMENTS

متن کامل

Treewidth in Verification: Local vs. Global

The treewidth of a graph measures how close the graph is to a tree. Many problems that are intractable for general graphs, are tractable when the graph has bounded treewidth. Recent works study the complexity of model checking for state transition systems of bounded treewidth. There is little reason to believe, however, that the treewidth of the state transition graphs of real systems, which we...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Philosophia

سال: 2016

ISSN: 0048-3893,1574-9274

DOI: 10.1007/s11406-016-9786-8